Unavoidable tournaments
نویسندگان
چکیده
A basic result in Ramsey theory states that any tournament contains a “large” transitive subgraph. Since transitive tournaments contain only transitive subgraphs, it is natural to ask which subgraphs must appear in any large tournament that is “far” from being transitive. One result of this type was obtained by Fox and Sudakov who characterized the tournaments that appear in any tournament that is -far from being transitive. Another result of this type was obtained by Berger et al. who characterized the tournaments that appear in any tournament that cannot be partitioned into a bounded number of transitive sets. In this paper we consider the common generalization of the above two results, namely the tournaments that must appear in any tournament that is -far from being the union of a bounded number of transitive sets. Our main result is a precise characterization of these tournaments.
منابع مشابه
Star-factors of tournaments
Let Sm denote the m-vertex simple digraph formed by m− 1 edges with a common tail. Let f(m) denote the minimum n such that every n-vertex tournament has a spanning subgraph consisting of n/m disjoint copies of Sm. We prove that m lgm−m lg lgm ≤ f(m) ≤ 4m − 6m for sufficiently large m. If D is an acyclic digraph of order n, then D occurs as a subgraph of every tournament with at least 2 vertices...
متن کاملLargest digraphs contained in all n-tournaments
A directed graph G is an unavoidable subgraph o f all n-tournaments or, simply n-unavoidable, if every tournament on n vertices contain san isomorphic copy o f G, i.e., for each ntournament T there exists an edge preserving injection o f the vertices o f G into the vertices o f T. The problem o f showing certain types o f graphs to be n-unavoidable has been the subject o f several papers, for e...
متن کاملTrees in tournaments
A digraph is said to be n-unavoidable if every tournament of order n contains it as a subgraph. Let f (n) be the smallest integer such that every oriented tree is f (n)-unavoidable. Sumner (see 7]) noted that f (n) 2n ? 2 and conjetured that equality holds. HH aggkvist and Thomason established the upper bounds f (n) 12n and f (n) (4 + o(1))n. Let g(k) be the smallest integer such that every ori...
متن کاملt-Pancyclic Arcs in Tournaments
Let $T$ be a non-trivial tournament. An arc is emph{$t$-pancyclic} in $T$, if it is contained in a cycle of length $ell$ for every $tleq ell leq |V(T)|$. Let $p^t(T)$ denote the number of $t$-pancyclic arcs in $T$ and $h^t(T)$ the maximum number of $t$-pancyclic arcs contained in the same Hamiltonian cycle of $T$. Moon ({em J. Combin. Inform. System Sci.}, {bf 19} (1994), 207-214) showed that $...
متن کاملA Further Step Towards an Understanding of the Tournament Equilibrium Set
We study some problems pertaining to the tournament equilibrium set (τ for short). A tournament H is a τ-retentive tournament if there is a tournament T which has a minimal τ-retentive set R such that T [R] is isomorphic to H. We study τ-retentive tournaments and achieve many significant results. In particular, we prove that there are no τretentive tournaments of size 4, only 2 non-isomorphic τ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 116 شماره
صفحات -
تاریخ انتشار 2016